ABSTRACT
The clustering of large numbers of heterogeneous features is a hot topic in multi-view communities. Most existing multi-view clustering (MvC) methods employ matrix factorization or anchor strategies to handle large-scale datasets. The former operates on the original data and is, therefore, sensitive to noise and feature redundancy, which is reflected in the final clustering performance. The latter requires post -processing steps to generate the clustering results, which may be suboptimal owing to the isolation steps. To address the above problems, we propose one-stage multi-view subspace clustering with dictionary learning (OSMvSC). Specifically, we integrate dictionary learning, representation coefficient matrix learning, and matrix factorization as a unified learning framework, which directly learns the dictionary and representation coefficient matrix to encode the original multi-view data, and obtains the clustering results with linear time complexity without any postprocessing step. By manipulating the class centroid with the nuclear norm, a more compact and discriminative class centroid representation can be obtained to further improve clustering performance. An effective optimization algorithm with guaranteed convergence is designed to solve the proposed method. Substantial experiments on various real-world multi-view datasets demonstrate the effectiveness and superiority of the proposed method. The source code is available at https://github.com/justcallmewilliam/OSMvSC.(c) 2022 Elsevier B.V. All rights reserved.